⌘K
Wow an absolute GOAT prof! Her videos were very clear and easy to follow, content was organized and accessible (unlike some profs who just hide important hyperlinks within the text). The midterms and final were fair, reminiscent of my first year Math 135 days with binomial theorem and Pascal's identity (really Omar Khayyam's identity as we learned) type proofs. Graph theory had seemed daunting at first but Dr. Foley's clear explanations were very helpful and helped me become more cognizant of its applications all around us. The exam was much easier than anticipated. Would definitely recommend this CP 214 with Dr. Foley and would gladly sign up for any others she is teaching!
Midterm is hard, but the final is pretty easy and simple!
Contributed by Students
CP 214
Finite and discrete algebraic structures relating to computers: sets, functions, relations. Machine-oriented logic. Topics include: propositional and predicate calculus, Boolean algebra, combinatorial counting (including Pigeonhole principle, permutations and combinations), recurrence equations, applications of recurrence equations in sorting algorithms, relations (including equivalence relations, partial orders), algorithms to generate permutations and combinations, induction and recursive programs, correctness proofs for both recursive and iterative program constructions, countable and uncountable sets, Cantor’s theorem, introduction to graph theory and graph algorithms. Prerequisites: CP164. Exclusions: MA238; May not be used for credit toward the Honours BSc Data Science program or Honours BSc Computer Science and Mathematics program.